An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree
نویسندگان
چکیده
منابع مشابه
An Approximation for Finding a Smallest 2-Edge-Connected Subgraph Containing a Specified Spanning Tree
Given a graph G = (V;E) and a tree T = (V; F ) with E \ F = ; such that G + T = (V;F [ E) is 2-edge-connected, we consider the problem of nding a smallest 2-edge-connected spanning subgraph (V;F [ E 0 ) of G+ T containing T . The problem, which is known to be NP-hard, admits a 2-approximation algorithm. However, obtaining a factor better than 2 for this problem has been one of the main open pro...
متن کاملImproving on the 1.5-Approximation of a Smallest 2-Edge Connected Spanning Subgraph
We give a 17 12-approximation algorithm for the following NP-hard problem: Given a simple undirected graph, nd a 2-edge connected spanning subgraph that has the minimum number of edges. The best previous approximation guarantee was 3 2. If the well known 4 3 conjecture for the metric TSP holds, then the optimal value (minimum number of edges) is at most 4 3 times the optimal value of a linear p...
متن کاملA 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph
The problem of finding a minimum weight k-vertex connected spanning subgraph in a graph G = (V,E) is considered. For k ≥ 2, this problem is known to be NP-hard. Combining properties of inclusionminimal k-vertex connected graphs and of k-out-connected graphs (i.e., graphs which contain a vertex from which there exist k internally vertex-disjoint paths to every other vertex), we derive an auxilia...
متن کاملFinding 2-edge connected spanning subgraphs
This paper studies the NP-hard problem of /nding a minimum size 2-edge connected spanning subgraph (2-ECSS). An algorithm is given that on an r-edge connected input graph G=(V; E) /nds a 2-ECSS of size at most |V |+(|E|−|V |)=(r−1). For r-regular, r-edge connected input graphs for r = 3, 4, 5 and 6, this gives approximation guarantees of 4 ; 4 3 ; 11 8 and 7 5 , respectively. c © 2003 Elsevier ...
متن کاملMinimum 2-Edge Connected Spanning Subgraph of Certain Interconnection Networks
Given an undirected graph, finding a minimum 2-edge connected spanning subgraph is NP-hard. We solve the problem for silicate network, brother cell and sierpiński gasket rhombus.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2003
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(02)00218-4